Application of “p”-multigrid to discontinuous Galerkin formulations of the Poisson equation

نویسندگان

  • B. T. Helenbrook
  • H. L. Atkins
چکیده

We investigate p-multigrid as a solution method for several different discontinuous Galerkin (DG) formulations of the Poisson equation. Different combinations of relaxation schemes and basis sets have been combined with the DG formulations to find the best performing combination. The damping factors of the schemes have been determined using Fourier analysis for both one and two-dimensional problems. One important finding is that when using DG formulations, the standard approach of forming the coarse p matrices separately for each level of multigrid is often unstable. To ensure stability the coarse p matrices must be constructed from the fine grid matrices using algebraic multigrid techniques. Of the relaxation schemes, we find that the combination of Jacobi relaxation with the spectral element basis is fairly effective. The results using this combination are p sensitive in both one and two dimensions, but reasonable convergence rates can still be achieved for moderate values of p and isotropic meshes. A competitive alternative is a block Gauss-Seidel relaxation. This actually out performs a more expensive line relaxation when the mesh is isotropic. When the mesh becomes highly anisotropic, the implicit line method and the Gauss-Seidel implicit line method are the only effective schemes. Adding the Gauss-Seidel terms to the implicit line method gives a significant improvement over the line relaxation method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust multigrid for high-order discontinuous Galerkin methods: A fast Poisson solver suitable for high-aspect ratio Cartesian grids

We present a polynomial multigrid method for nodal interior penalty and local discontinuous Galerkin formulations of the Poisson equation on Cartesian grids. For smoothing we propose two classes of overlapping Schwarz methods. The first class comprises element-centered and the second face-centered methods. Within both classes we identify methods that achieve superior convergence rates, prove ro...

متن کامل

Robust Multigrid for Cartesian Interior Penalty DG Formulations of the Poisson Equation in 3D

We present a polynomial multigrid method for the nodal interior penalty formulation of the Poisson equation on three-dimensional Cartesian grids. Its key ingredient is a weighted overlapping Schwarz smoother operating on element-centered subdomains. The MG method reaches superior convergence rates corresponding to residual reductions of about two orders of magnitude within a single V(1,1) cycle...

متن کامل

A robust multigrid method for discontinuous Galerkin discretizations of Stokes and linear elasticity equations

We consider multigrid methods for discontinuous Galerkin (DG) H(div, Ω)-conforming discretizations of the Stokes equation. We first describe a simple Uzawa iteration for the solution of the Stokes problem, which requires a solution of a nearly incompressible linear elasticity problem on every iteration. Then, based on special subspace decompositions of H(div, Ω), as introduced in [J. Schöberl. ...

متن کامل

A fast, p-Multigrid Discontinuous Galerkin Method for Compressible Flows at All Speeds

A p-multigrid (p=polynomial degree) discontinuous Galerkin method is presented for the solution of the compressible Euler equations on unstructured grids. The method operates on a sequence of solution approximations of different polynomial orders. A distinct feature of this p-multigrid method is the application of an explicit smoother on the higher level approximations (p > 0) and an implicit s...

متن کامل

hp-Multigrid as Smoother algorithm for higher order discontinuous Galerkin discretizations of advection dominated flows: Part I. Multilevel analysis

The hp-Multigrid as Smoother algorithm (hp-MGS) for the solution of higher order accurate space–time discontinuous Galerkin discretizations of advection dominated flows is presented. This algorithm combines p-multigrid with h-multigrid at all p-levels, where the h-multigrid acts as smoother in the p-multigrid. The performance of the hp-MGS algorithm is further improved using semi-coarsening in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008